Fractality and degree correlations in scale-free networks
نویسندگان
چکیده
منابع مشابه
Fractality and degree correlations in scale-free networks
Fractal scale-free networks are empirically known to exhibit disassortative degree mixing. It is, however, not obvious whether a negative degree correlation between nearest neighbor nodes makes a scale-free network fractal. Here we examine the possibility that disassortativity in complex networks is the origin of fractality. To this end, maximally disassortative (MD) networks are prepared by re...
متن کاملDegree Correlations in Directed Scale-Free Networks
Scale-free networks, in which the distribution of the degrees obeys a power-law, are ubiquitous in the study of complex systems. One basic network property that relates to the structure of the links found is the degree assortativity, which is a measure of the correlation between the degrees of the nodes at the end of the links. Degree correlations are known to affect both the structure of a net...
متن کاملIntrinsic degree-correlations in static scale-free networks
We calculate the mean neighboring degree function k̄nn(k) and the mean clustering function C(k) of vertices with degree k as a function of k in finite scale-free random networks through the static model. While both are independent of k when the degree exponent γ ≥ 3, they show the crossover behavior for 2 < γ < 3 from k-independent behavior for small k to k-dependent behavior for large k. The k-...
متن کاملFractality and self-similarity in scale-free networks
Fractal scaling and self-similar connectivity behaviour of scale-free (SF) networks are reviewed and investigated in diverse aspects. We first recall an algorithm of box-covering that is useful and easy to implement in SF networks, the so-called random sequential box-covering. Next, to understand the origin of the fractal scaling, fractal networks are viewed as comprising of a skeleton and shor...
متن کاملDegree landscapes in scale-free networks.
We generalize the degree-organizational view of real-world networks with broad degree distributions in a landscape analog with mountains (high-degree nodes) and valleys (low-degree nodes). For example, correlated degrees between adjacent nodes correspond to smooth landscapes (social networks), hierarchical networks to one-mountain landscapes (the Internet), and degree-disassortative networks wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B
سال: 2017
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2017-80031-x